Extension of the value function reformulation to multiobjective bilevel optimization

نویسندگان

چکیده

Abstract We consider a multiobjective bilevel optimization problem with vector-valued upper- and lower-level objective functions. Such problems have attracted lot of interest in recent years. However, so far, scalarization has appeared to be the main approach used deal problem. Here, we utilize concept frontier map that extends notion optimal value function our parametric Based on this, build tractable constraint qualification use derive necessary optimality conditions for Subsequently, show resulting represent natural extension from standard optimistic programs scalar

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiobjective bilevel optimization

In this work nonlinear non-convex multiobjective bilevel optimization problems are discussed using an optimistic approach. It is shown that the set of feasible points of the upper level function, the so-called induced set, can be expressed as the set of minimal solutions of a multiobjective optimization problem. This artificial problem is solved by using a scalarization approach by Pascoletti a...

متن کامل

Connections Between Single-Level and Bilevel Multiobjective Optimization

The relationship between bilevel optimization and multiobjective optimization has been studied by several authors and there have been repeated attempts to establish a link between the two. We unify the results from the literature and generalize them for bilevel multiobjective optimization. We formulate sufficient conditions for an arbitrary binary relation to guarantee equality between the effi...

متن کامل

Nonlinear-programming reformulation of the order-value optimization problem

Order-value optimization (OVO) is a generalization of the minimax problem motivated by decision-making problems under uncertainty and by robust estimation. New optimality conditions for this nonsmooth optimization problem are derived. An equivalent mathematical programming problem with equilibrium constraints is deduced. The relation between OVO and this nonlinear-programming reformulation is s...

متن کامل

KKT Reformulation and Necessary Conditions for Optimality in Nonsmooth Bilevel Optimization

For a long time, the bilevel programming problem has essentially been considered as a special case of mathematical programs with equilibrium constraints (MPECs), in particular when the so-called KKT reformulation is in question. Recently though, this widespread believe was shown to be false in general. In this paper, other aspects of the difference between both problems are revealed as we consi...

متن کامل

Necessary Optimality Conditions for Multiobjective Bilevel Programs

The multiobjective bilevel program is a sequence of two optimization problems, with the upper-level problem being multiobjective and the constraint region of the upper level problem being determined implicitly by the solution set to the lower-level problem. In the case where the Karush-Kuhn-Tucker (KKT) condition is necessary and sufficient for global optimality of all lower-level problems near...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Optimization Letters

سال: 2022

ISSN: ['1862-4480', '1862-4472']

DOI: https://doi.org/10.1007/s11590-022-01948-9